INHERENTLY PARALLEL GEOMETRIC COMPUTATIONS

Inherently Parallel Geometric Computations

A new computational paradigm is described which o ers the possibility of superlinear (and sometimes unbounded) speedup, when parallel computation is used. The computations involved are subject only to given mathematical constraints and hence do not depend on external circumstances to achieve superlinear performance. The focus here is on geometric transformations. Given a geometric object A with...

Inherently Parallel Computations

The term inherently parallel computation refers to a computation that can be performed successfully only on a parallel computer with an appropriate number of processors. Examples are computations that involve: time-varying variables, time-varying complexity, rank-varying complexity, interacting variables, uncertain time constraints, and variables obeying mathematical constraints. These computat...

Inherently Parallel Geometric Problems

A new computational paradigm is described which o ers the possibility of superlinear (and sometimes unbounded) speedup, when parallel computation is used. The computations involved are subject only to given mathematical constraints and hence do not depend on external circumstances to achieve superlinear performance. The focus here is on geometric transformations. Given a geometric object A with...

Geometric Computations for Simulation

Robustness in Geometric Computations

Geometric computation software tends to be fragile and fails occasionally. This robustness problem is rooted in the difficulty of making unambiguous decisions about incidence and nonincidence, fundamentally impairing layering the geometry software reliably. Additionally, geometric operations tend to have a large number of special and singular cases, further adding to the difficulty of creating ...